Third International Competition on Runtime Verification (CRV16) Giles Reger, Sylvain Hall´e, Yli`es Falcone RV 2016

Source URL: www.cs.man.ac.uk

• Benchmark
• Standard Performance Evaluation Corporation
• European BEST Engineering Competition
• Computing
• Information and communications technology

Checkable Proofs for First-Order Theorem Proving Giles Reger1 , Martin Suda2 1 School of Computer Science, University of Manchester, UK 2 TU Wien, Vienna, Austria

Source URL: www.cs.man.ac.uk

• Software
• Automated theorem proving
• Theoretical computer science
• Formal methods
• TPTP
• Proof assistant
• Frama-C
• Theorem prover
• E theorem prover
• Theorem
• Isabelle

From First-order Temporal Logic to Parametric Trace Slicing Giles Reger and David Rydeheard University of Manchester, Manchester, UK Abstract. Parametric runtime verification is the process of verifying properties of ex

Source URL: www.cs.man.ac.uk

• Temporal logic
• Formal languages
• Logic
• Metalogic
• Mathematical logic
• Linear temporal logic
• Mathematics
• Model theory
• Symbol
• Computation tree logic
• Interpretation
• Well-formed formula

Second International Competition on Runtime Verification CRV 2015 Yli`es Falcone1 , Dejan Nickovic2 , Giles Reger3 , and Daniel Thoma4 1

Source URL: www.cs.man.ac.uk

• Computing
• Cross-platform software
• Logic in computer science
• Runtime verification
• Benchmark
• Standard Performance Evaluation Corporation
• Computer performance
• Java

Motivation Edits Better than Verdicts Adding Labels

Source URL: www.cs.man.ac.uk

We know (nearly) nothing! But can we learn? ? Stephan Schulz

Source URL: www.cs.man.ac.uk

Considering Typestate Verification for Quantified Event Automata Giles Reger University of Manchester, Manchester, UK Abstract. This paper discusses how the existing static analyses developed for

Source URL: www.cs.man.ac.uk

• Program analysis
• Typestate analysis
• Mathematical logic
• Logic
• Mathematics
• Runtime verification
• Quantifier
• Type system
• Sheaf

Suggesting Edits to Explain Failing Traces Giles Reger University of Manchester, UK Abstract. Runtime verification involves checking whether an execution trace produced by a running system satisfies a specification. Howe

Source URL: www.cs.man.ac.uk

• Mathematics
• Algebra
• Theoretical computer science
• Finite automata
• Linear algebra
• Finite-state transducer
• Dynamic programming
• Edit distance
• Trace
• Finite-state machine
• Shortest path problem
• Levenshtein distance

Do Portfolio Solvers Harm? Christoph Weidenbach Max Planck Insitute for Informatics Saarland Informatics CampusSaarbr¨ ucken, Germany

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Logic in computer science
• Formal methods
• Automated reasoning
• Constraint programming
• Automated theorem proving
• Satisfiability modulo theories
• Solver
• Answer set programming
• Satz
• Model checking
• Algorithm selection

Testing a Saturation-Based Theorem Prover: Experiences and Challenges Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,2 1 School of Computer Science, University of Manchester, UK

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Formal methods
• Mathematical logic
• School of Computer Science
• University of Manchester
• Mathematics
• Logic in computer science
• Automated theorem proving
• Formal verification
• SPASS
• Andrei Voronkov
• Vampire
• First-order logic